Statistical Properties of Strings

نویسنده

  • M. Hindmarsh
چکیده

We investigate numerically the configurational statistics of strings. The algorithm models an ensemble of global U(1) cosmic strings, or equivalently vortices in superfluid He. We use a new method which avoids the specification of boundary conditions on the lattice. We therefore do not have the artificial distinction between short and long string loops or a ‘second phase’ in the string network statistics associated with strings winding around a toroidal lattice. Our lattice is also tetrahedral, which avoids ambiguities associated with the cubic lattices of previous work. We find that the percentage of infinite string is somewhat lower than on cubic lattices, 63% instead of 80%. We also investigate the Hagedorn transition, at which infinite strings percolate, controlling the string density by rendering one of the equilibrium states more probable. We measure the percolation threshold, the

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Definability and Compression

A compression algorithm takes a finite structure of a class K as input and produces a finite structure of a different class K’ as output. Given a property P on the class K defined in a logicL, we study the definability of property P on the class K’. We consider two compression schemas on unary ordered structures (words), compression by runlength encoding and the classical Lempel-Ziv. First-orde...

متن کامل

Evaluating UMLS strings for natural language processing

The National Library of Medicine's Unified Medical Language System (UMLS) is a rich source of knowledge in the biomedical domain. The UMLS is used for research and development in a range of different applications, including natural language processing (NLP). In this paper we investigate the nature of the strings found in the UMLS Metathesaurus and evaluate them for their usefulness in NLP. We b...

متن کامل

Deenability and Compression

A compression algorithm takes a nite structure of a class K as input and produces a nite structure of a diierent class K' as output. Given a property P on the class K deened in a logic L, we study the deenability of property P on the class K'. We consider two compression schemas on unary ordered structures (words), a naive compression and the classical Lempel-Ziv. First-order properties of stri...

متن کامل

Statistical Properties of Query Strings

We study the statistical properties of query search strings in the Gnutella peer-to-peer network and find that the distribution of query frequency (how often queries are made) closely follows a lognormal distribution. We find evidence for an upper bound on query cache performance and extend previous studies of Gnutella query caching to model effectiveness of such schemes.

متن کامل

مقایسه پاسخ بافتی اطراف سه نوع نخ بخیه سیلک غیرقابل جذب چند رشته ای: یک مطالعه حیوانی

Introduction: The tissue reaction to stitch strings used in the intraoral surgery that can aggravate inflammation is an important issue. This study aimed to compare the tissue reaction formed around three types of stitches, including Demesilk (Demetech corporation,USA) that is not produced inside the country, Pedsilk and Suture, which all are natural nonabsorbable, on rats. Methods: In this ex...

متن کامل

SCOT Modeling and Its Statistical Applications of Time Series

We modeled and applied Stochastic COntext Tree (SCOT) for statistical inference about financial, literary and seismological stationary strings. We analyzed several models viewed as simplified approaches to financial modeling: evaluate their stationary distribution, entropy rate and convergence to the Brownian motion. We also estimated the SCOT parameters and tested homogeneity of data strings u...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008